Functions on Groups and Computational Complexity
نویسنده
چکیده
We give some connections between various functions defined on finitely presented groups (isoperimetric, isodiametric, Todd-Coxeter radius, filling length functions, etc.), and we study the relation between those functions and the computational complexity of the word problem (deterministic time, nondeterministic time, symmetric space). We show that the isoperimetric function can always be linearly decreased (unless it is the identity map). We present a new proof of the Double Exponential Inequality, based on context-free languages.
منابع مشابه
OPTIMUM DESIGN OF FILAMENT–WOUND LAMINATED CONICAL SHELLS FOR BUCKLING USING THE PENALTY FUNCTION
Optimum laminate configuration for minimum weight of filament–wound laminated conical shells subject to buckling load constraint is investigated. In the case of a laminated conical shell the thickness and the ply orientation (the design variables) are functions of the shell coordinates, influencing both the buckling load and its weight. These effects complicate the optimization problem consider...
متن کاملOn the computational complexity of finding a minimal basis for the guess and determine attack
Guess-and-determine attack is one of the general attacks on stream ciphers. It is a common cryptanalysis tool for evaluating security of stream ciphers. The effectiveness of this attack is based on the number of unknown bits which will be guessed by the attacker to break the cryptosystem. In this work, we present a relation between the minimum numbers of the guessed bits and uniquely restricted...
متن کاملControlling Nonlinear Processes, using Laguerre Functions Based Adaptive Model Predictive Control (AMPC) Algorithm
Laguerre function has many advantages such as good approximation capability for different systems, low computational complexity and the facility of on-line parameter identification. Therefore, it is widely adopted for complex industrial process control. In this work, Laguerre function based adaptive model predictive control algorithm (AMPC) was implemented to control continuous stirred tank rea...
متن کاملBiclique Cryptanalysis of Block Ciphers LBlock and TWINE-80 with Practical Data Complexity
In the biclique attack, a shorter biclique usually results in less data complexity, but at the expense of more computational complexity. The early abort technique can be used in partial matching part of the biclique attack in order to slightly reduce the computations. In this paper, we make use of this technique, but instead of slight improvement in the computational complexity, we keep the amo...
متن کاملOn the Computational Complexity of the Domination Game
The domination game is played on an arbitrary graph $G$ by two players, Dominator and Staller. It is known that verifying whether the game domination number of a graph is bounded by a given integer $k$ is PSPACE-complete. On the other hand, it is showed in this paper that the problem can be solved for a graph $G$ in $mathcal O(Delta(G)cdot |V(G)|^k)$ time. In the special case when $k=3$ and the...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- IJAC
دوره 14 شماره
صفحات -
تاریخ انتشار 2004